The Range of Stable Random Walks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS

A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...

متن کامل

Moderate deviations for the range of planar random walks

Given a symmetric random walk in Z2 with finite second moments, let Rn be the range of the random walk up to time n. We study moderate deviations for Rn −ERn and ERn−Rn. We also derive the corresponding laws of the iterated logarithm.

متن کامل

Anomalous Threshold Behavior of Long Range Random Walks

We consider weighted graphs satisfying sub-Gaussian estimate for the natural random walk. On such graphs, we study symmetric Markov chains with heavy tailed jumps. We establish a threshold behavior of such Markov chains when the index governing the tail heaviness (or jump index) equals the escape time exponent (or walk dimension) of the sub-Gaussian estimate. In a certain sense, this generalize...

متن کامل

Random walks with long-range self-repulsion on proper time

We introduce a model of self-repelling random walks where the short-range interaction between two elements of the chain decreases as a power of the difference in proper time. Analytic results on the exponent ν are obtained. They are in good agreement with Monte Carlo simulations in two dimensions. A numerical study of the scaling functions and of the efficiency of the algorithm is also presented.

متن کامل

Long-Range Navigation on Complex Networks using Lévy Random Walks

We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Lévy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1991

ISSN: 0091-1798

DOI: 10.1214/aop/1176990446